class Solution(object):
    def minSubsequence(self, nums):
        nums.sort(reverse=True)
        t = sum(nums)
        q = 0
        for i in range(len(nums)):
            q += nums[i]
            if q > t - q:
                return nums[:i + 1]